VeriSHIM A BDD Verifier for SHIM

Concurrent programming languages have become more popular with the advent of multi-core systems. Shared memory is read or written atomically, by concurrent processes to prevent races. A typical mechanism is the use of locks. However, if locks are not acquired and released in the correct order, the result is a deadlock. In this paper, we propose a deadlock detection tool for a deterministic, concurrent language, SHIM. SHIM is race free but not deadlock free. A deadlock can easily be detected while the program is running, but here we use static approaches to find deadlocks in a program. Enumerating all possible states is not feasible because there will be explosion of states. We exploit the deterministic property of SHIM and do a BDD based reacha-bility analysis after abstracting parts of the program. We run the deadlock detector on the the JPEG decoder and report the results.